On Epidemic-aware Socio Spatial POI Recommendation

Epidemics such as COVID-19, SARS, H1N1 have highly transmissible viruses and spread wildly through the population with negative consequences. Multiple studies have shown the correlation between the contact networks between individuals and the transmission of infections due to contact between colocated individuals. To mitigate the transmission of the virus, intervention measures have been applied without decisive success. Therefore, reducing transmissions through suitable epidemicaware POI recommendations to users is necessary to cope with user mobility. Current POI recommendation approaches do not take into consideration the transmission of infections between co-located users. In this paper, we formulate a new query named Epidemic-aware POI Recommendation Query (EPQ), to timely recommend a set of POIs to users at different time steps, while considering the spread of infection between co-located users, their social friendships, and their preference. We prove that EPQ is NP-hard and propose an effective and efficient algorithm, Epidemic-aware POI Recommendation (EpRec) to tackle EPQ. We evaluate EpRec on existing location-based social networks and pandemic datasets against state-of-the-art algorithms. The experimental results show that EpRec outperforms the baselines in effectiveness and efficiency. © 2022 IEEE.

Epidemic Spread Optimization for Disease Containment with NPIs and Vaccination

The potential impact of epidemics, e.g., COVID-19, H1N1, and SARS, is severe on public health, the economy, education, and society. Before effective treatments are available and vaccines are fully deployed, combining Non-Pharmaceutical Interventions (NPIs) and vaccination strategies is the main approaches to contain the epidemic or live with the virus. Therefore, research for deciding the best containment operations to contain the epidemic based on various objectives and concerns is much needed. In this paper, we formulate the problem of Containment Operation Optimization Design (COOD) that optimizes the epidemic containment by carefully analyzing contacts between individuals. We prove the hardness of COOD and propose an approximation algorithm, named Multi-Type Action Scheduling (MTAS), with the ideas of Infected Ratio, Contact Risk, and Severity Score to select and schedule appropriate actions that implement NPIs and allocate vaccines for different groups of people. We evaluate MTAS on real epidemic data of a population with real contacts and compare it against existing approaches in epidemic and misinformation containment. Experimental results demonstrate that MTAS improves at least 200% over the baselines in the test case of sustaining public health and the economy. Moreover, the applicability of MTAS to various epidemics of different dynamics is demonstrated, i.e., MTAS can effectively slow down the peak and reduce the number of infected individuals at the peak. © 2022 IEEE.